Graceful Overload Management in Firm Real-Time Systems
نویسنده
چکیده
In real-time environments, tasks have to complete by their deadlines. As we restrict our attention to mono-processor systems, a scheduling algorithm aims to determine which task is to execute on the processor [1,2]. On-line scheduling algorithms have been designed under non-overloaded conditions. We say that a real-time system is overloaded when it is impossible to schedule it on the processor such that all the tasks meet their deadlines. Classical online priority driven schedulers perform poorly as compared to offline clairvoyant ones in overloaded conditions.
منابع مشابه
Providing Real-Time Applications With Graceful Degradation of QoS and Fault Tolerance According to(m, k)-Firm Model
(m,k)-firm model has recently drawn a lot of attention. It provides a flexible real-time system with graceful degradation of the QoS, thus achieving the fault tolerance in case of system overload. In this paper we first give a review of the existing work on the use of the (m,k)-firm model for handling the QoS and fault tolerance management. Then we focus on DBP algorithm as it presents the inte...
متن کاملValue-Driven Multi-Class Overload Management
While it is imperative that all time constraints are met in hard real-time systems, firm or soft real-time systems do not have as stringent timeliness requirements, allowing for some degree of tardiness (soft) or miss ratio (firm). A significant body of research within the soft and firm real-time area has focused on minimizing tardiness and/or miss ratio, but without quantifying acceptable leve...
متن کاملHandling Overload and Data-Relaxation Control in Distributed Real-Time Database Systems
Current applications are distributed in nature and manipulate time-critical databases with firm-deadline transactions. To guarantee performance and availability of such applications fault-tolerant mechanisms need to be developed. In the context of time critical applications, this also leads to providing means to ensure that as many as possible real-time transactions satisfy their deadline in th...
متن کاملMulticlass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems
Real-Time Database Systems (RTDBSs), have attracted considerable amount of research attention in the recent past and a number of important applications have been identi ed for such systems, such as telecommunications network management, automated air tra c control, automated nancial trading, process control and military command and control systems. Due to the rapidity of change of the system st...
متن کاملRobust Aperiodic Scheduling Under Dynamic Priority Systems
When hard periodic and f&-m aperiodic tasks are jointly scheduled in the same system, the processor workload can vary according to the arrival times of aperiodic requests. In order to guarantee the schedulability of the periodic task set, in overload conditions some aperiodic tasks must be rejected. In this paper we propose a technique that, in overload conditions, adds robustness to the joint ...
متن کامل